Power spectra of the natural input to the visual system

AbstractThe efficient coding hypothesis posits that sensory systems are adapted to the regularities of their signal input so as to reduce redundancy in the resulting representations. It is therefore important to characterize the regularities of natural signals to gain insight into the processing of natural stimuli. While measurements of statistical regularity in vision have focused on photographic images of natural environments it has been much less investigated, how the specific imaging process embodied by the organism’s eye induces statistical dependencies on the natural input to the visual system. This has allowed using the convenient assumption that natural image data are homogeneous across the visual field. Here we give up on this assumption and show how the imaging process in a human model eye influences the local statistics of the natural input to the visual system across the entire visual field. Artificial scenes with three-dimensional edge elements were generated and the influence of the imaging projection onto the back of a spherical model eye were quantified. These distributions show a strong radial influence of the imaging process on the resulting edge statistics with increasing eccentricity from the model fovea. This influence is further quantified through computation of the second order intensity statistics as a function of eccentricity from the center of projection using samples from the dead leaves image model. Using data from a naturalistic virtual environment, which allows generation of correctly projected images onto the model eye across the entire field of view, we quantified the second order dependencies as function of the position in the visual field using a new generalized parameterization of the power spectra. Finally, we compared this analysis with a commonly used natural image database, the van Hateren database, and show good agreement within the small field of view available in these photographic images. We conclude by providing a detailed quantitative analysis of the second order statistical dependencies of the natural input to the visual system across the visual field and demonstrating the importance of considering the influence of the sensory system on the statistical regularities of the input to the visual system

Impending Backlog of Cleft Palate Patients Due to COVID-19

Coronavirus disease 2019 (COVID-19) has placed an unprecedented strain on healthcare systems worldwide, but while high-income countries (HICs) have been able to adapt, low- and middle-income countries (LMICs) have been much slower to do so due to a lack of funding, skilled healthcare providers, equipment, and facilities. The redistribution of resources to combat the pandemic in LMICs has resulted in decreased surgical volumes at local surgical centers as well as a dramatic reduction in the number of humanitarian aid missions. Despite recent global investment in improving the surgical capacities of LMICs, even in the pre-COVID-19 era there was a vast unmet surgical need. This deficit in surgical capacity has grown during the pandemic and it will be a significant struggle to overcome the resulting backlog of patients. A topic of particular concern to the authors is the effect that the pandemic will have on the delivery of time-sensitive surgical care to patients with cleft palate deformities as delay in providing care can have enormous physical and psychosocial consequences. This paper draws increased attention to the lasting impact that the COVID-19 pandemic may have on cleft palate patients in LMICs. SSRN Pre-print server link: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3898055

Combinatorial Voter Control in Elections

Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who would otherwise not attend the election. Traditionally, voters are added one at a time, with the goal of making a distinguished alternative win by adding a minimum number of voters. In this paper, we initiate the study of combinatorial variants of control by adding voters: In our setting, when we choose to add a voter~$v$, we also have to add a whole bundle $\kappa(v)$ of voters associated with $v$. We study the computational complexity of this problem for two of the most basic voting rules, namely the Plurality rule and the Condorcet rule.Comment: An extended abstract appears in MFCS 201

A Survey on Approximation Mechanism Design without Money for Facility Games

In a facility game one or more facilities are placed in a metric space to serve a set of selfish agents whose addresses are their private information. In a classical facility game, each agent wants to be as close to a facility as possible, and the cost of an agent can be defined as the distance between her location and the closest facility. In an obnoxious facility game, each agent wants to be far away from all facilities, and her utility is the distance from her location to the facility set. The objective of each agent is to minimize her cost or maximize her utility. An agent may lie if, by doing so, more benefit can be obtained. We are interested in social choice mechanisms that do not utilize payments. The game designer aims at a mechanism that is strategy-proof, in the sense that any agent cannot benefit by misreporting her address, or, even better, group strategy-proof, in the sense that any coalition of agents cannot all benefit by lying. Meanwhile, it is desirable to have the mechanism to be approximately optimal with respect to a chosen objective function. Several models for such approximation mechanism design without money for facility games have been proposed. In this paper we briefly review these models and related results for both deterministic and randomized mechanisms, and meanwhile we present a general framework for approximation mechanism design without money for facility games

A Recombination-Based Tabu Search Algorithm for the Winner Determination Problem

Abstract. We propose a dedicated tabu search algorithm (TSX_WDP) for the winner determination problem (WDP) in combinatorial auctions. TSX_WDP integrates two complementary neighborhoods designed re-spectively for intensification and diversification. To escape deep local optima, TSX_WDP employs a backbone-based recombination opera-tor to generate new starting points for tabu search and to displace the search into unexplored promising regions. The recombination operator operates on elite solutions previously found which are recorded in an global archive. The performance of our algorithm is assessed on a set of 500 well-known WDP benchmark instances. Comparisons with five state of the art algorithms demonstrate the effectiveness of our approach

Structuring Collaboration Scripts: Optimizing online group work on classroom dilemmas in teacher education

The optimal structure in collaboration scripts for serious games has appeared to be a key success factor. In this study we compare a ‘high- structured’ and ‘low-structured’ version of a mastership game where teachers-in-training discuss solutions on classroom dilemmas. We collected data on the differences in learning effects and student appreciation. The most interesting result shows that reports delivered by students that played the low-structured version received significantly higher teacher grades when compared to the high-structured version

Elite formation, power and space in contemporary London

In this paper we examine elite formation in relation to money power within the city of London. Our primary aim is to consider the impact of the massive concentration of such power upon the city’s political life, municipal and shared resources and social equity. We argue that objectives of city success have come to be identified and aligned with the presence of wealth elites while wider goals, of access to essential resources for citizens, have withered. A diverse national and global wealth-elite is drawn to a city with an almost unique cultural infrastructure, fiscal regime and ushering butler class of politicians. We consider how London is being made for money and the monied – in physical, political and cultural terms. We conclude that the conceptualisation of elites as wealth and social power formations operating within urban spatial arenas is important for capturing the nature of new social divisions and changes

Bottomonium in the plasma: Lattice results

We present results on the heavy quarkonium spectrum and spectral functions obtained by performing large-scale simulations of QCD for temperatures ranging from about 100 to 500 MeV, in the same range as those explored by LHC experiments. We discuss our method and perspectives for further improvements towards the goal of full control over the many systematic uncertainties of these studies

Computing optimal coalition structures in polynomial time

The optimal coalition structure determination problem is in general computationally hard. In this article, we identify some problem instances for which the space of possible coalition structures has a certain form and constructively prove that the problem is polynomial time solvable. Specifically, we consider games with an ordering over the players and introduce a distance metric for measuring the distance between any two structures. In terms of this metric, we define the property of monotonicity, meaning that coalition structures closer to the optimal, as measured by the metric, have higher value than those further away. Similarly, quasi-monotonicity means that part of the space of coalition structures is monotonic, while part of it is non-monotonic. (Quasi)-monotonicity is a property that can be satisfied by coalition games in characteristic function form and also those in partition function form. For a setting with a monotonic value function and a known player ordering, we prove that the optimal coalition structure determination problem is polynomial time solvable and devise such an algorithm using a greedy approach. We extend this algorithm to quasi-monotonic value functions and demonstrate how its time complexity improves from exponential to polynomial as the degree of monotonicity of the value function increases. We go further and consider a setting in which the value function is monotonic and an ordering over the players is known to exist but ordering itself is unknown. For this setting too, we prove that the coalition structure determination problem is polynomial time solvable and devise such an algorithm